Retracted: Multiconstraint-Oriented Tactical Communication Network Planning Problem
نویسندگان
چکیده
منابع مشابه
Tactical network planning for food aid distribution in Kenya
In Sub-Saharan Africa, annual weather patterns cause recurrent shocks which make the population vulnerable to food insecurity. In some regions, seasonal droughts create regular food shortages that are mitigated through sustained food aid. The objective of this study is to design an effective lastmile food aid distribution network in such a context. It is based on the food aid distribution probl...
متن کاملTactical Planning using Heuristics
Modern transportation problems are highly dynamic and time critical. A planning system for transportation problems must therefore include efficient and flexible planning and replanning strategies. In this paper we introduce a general agent-based framework for highly dynamic order-based transportation planning problems where a tactical planner and several operational planners (one for each trans...
متن کاملTACTICS: TACTICal Service Oriented Architecture
Due to the increasing complexity and heterogeneity of contemporary Command, Control, Communications, Computers, & Intelligence systems at all levels within military organizations, the adoption of the Service Oriented Architectures (SOA) principles and concepts is becoming essential. SOA provides flexibility and interoperability of services enabling the realization of efficient and modular infor...
متن کاملApplication of PROBE to the Multiconstraint Knapsack Problem
We consider the application of a new metaheuristic technique that we have proposed, known as PROBE (Population Reinforced Optimization Based Exploration), to the multiconstraint knapsack problem (MKP). In the current section, we begin by giving a brief introduction to PROBE; we then briefly review other metaheuristic approaches for the MKP. In Section 2, we describe our PROBE approach for the M...
متن کاملThe Multiconstraint Team Orienteering Problem with Multiple Time Windows
The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wireless Communications and Mobile Computing
سال: 2023
ISSN: ['1530-8669', '1530-8677']
DOI: https://doi.org/10.1155/2023/9851019